FETI and BDD preconditioners for Stokes–Mortar–Darcy Systems
نویسندگان
چکیده
منابع مشابه
FETI and BDD Preconditioners for Stokes-Mortar-Darcy Systems
We consider the coupling across an interface of a fluid flow and a porous media flow. The differential equations involve Stokes equations in the fluid region and Darcy equations in the porous region, and a coupling through an interface with Beaver-Joseph-Saffman transmission conditions. The discretization consists of P2/P1 triangular Taylor-Hood finite elements in the fluid region, the lowest o...
متن کاملPreconditioners for the Dual - Primal FETI
K e y w o r d s F E T I D P , ~Ionmatching grids, Mortar matching condition, Preconditioner. 1. I N T R O D U C T I O N The finite-element tearing and interconnecting (FETI) method is one of the substructuring methods, which was first introduced by Farhat and Roux [3]. The main idea is to match the continuity condition across subdomain boundaries by Lagrange multipliers. By eliminating primal v...
متن کاملOptimized interface preconditioners for the FETI method
In the past two decades, the FETI method introduced in [10] and its variants have become a class of popular methods for the parallel solution of large-scale finite element problems, see e.g. [11], [9], [14], [15], [8]. A key ingredient in this class of methods is a good preconditioner for the dual Schur complement system whose operator is a weighted sum of subdomain Neumann to Dirichlet (NtD) m...
متن کاملPreconditioners for the dual-primal FETI methods on nonmatching grids: Numerical study
FETI-DP method is a substructuring method that uses Lagrange multipliers to match the continuity condition on the subdomain boundaries. For the FETI-DP method on nonmatching grids, two different formulations are known with respect to how to employ the mortar matching condition. Keeping step with the developments of the FETI-DP methods, a variety of preconditioners for the FETI-DP operator have ...
متن کاملBDD extensions for stochastic transition systems
A BDD (Binary Decision Diagram) is a compact canonical representation of a Boolean function. While BDDs are well-established in the area of functional system verification, their use for the purpose of performance analysis is a new idea. We use BDDs to represent labelled transition systems which arise from higher-level model specifications such as stochastic process algebras or structured stocha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Applied Mathematics and Computational Science
سال: 2010
ISSN: 2157-5452,1559-3940
DOI: 10.2140/camcos.2010.5.1